- axiomatizable theory
- мат.аксиоматизируемая теория
English-Russian scientific dictionary. 2008.
axiomatizable theory
Смотреть что такое "axiomatizable theory" в других словарях:
ω-consistent theory — In mathematical logic, an ω consistent (or omega consistent, also called numerically segregative[1]) theory is a theory (collection of sentences) that is not only (syntactically) consistent (that is, does not prove a contradiction), but also… … Wikipedia
Ω-consistent theory — In mathematical logic, an ω consistent (or omega consistent, also called numerically segregativeW.V.O. Quine, Set Theory and its Logic ] ) theory is a theory (collection of sentences) that is not only (syntactically) consistent (that is, does not … Wikipedia
Model theory — This article is about the mathematical discipline. For the informal notion in other parts of mathematics and science, see Mathematical model. In mathematics, model theory is the study of (classes of) mathematical structures (e.g. groups, fields,… … Wikipedia
General set theory — (GST) is George Boolos s (1998) name for a three axiom fragment of the canonical axiomatic set theory Z. GST is sufficient for all mathematics not requiring infinite sets, and is the weakest known set theory whose theorems include the Peano… … Wikipedia
Zermelo–Fraenkel set theory — Zermelo–Fraenkel set theory, with the axiom of choice, commonly abbreviated ZFC, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics.ZFC consists of a single primitive ontological notion, that of… … Wikipedia
Complete theory — In mathematical logic, a theory is complete if it is a maximal consistent set of sentences, i.e., if it is consistent, and none of its proper extensions is consistent. For theories in logics which contain classical propositional logic, this is… … Wikipedia
logic, history of — Introduction the history of the discipline from its origins among the ancient Greeks to the present time. Origins of logic in the West Precursors of ancient logic There was a medieval tradition according to which the Greek philosopher … Universalium
Decidability (logic) — In logic, the term decidable refers to the decision problem, the question of the existence of an effective method for determining membership in a set of formulas. Logical systems such as propositional logic are decidable if membership in their… … Wikipedia
List of first-order theories — In mathematical logic, a first order theory is given by a set of axioms in somelanguage. This entry lists some of the more common examples used in model theory and some of their properties. PreliminariesFor every natural mathematical structure… … Wikipedia
Elementary class — In the branch of mathematical logic called model theory, an elementary class (or axiomatizable class) is a class consisting of all structures satisfying a fixed first order theory. Contents 1 Definition 2 Conflicting and alternative terminology … Wikipedia
Relation algebra — is different from relational algebra, a framework developed by Edgar Codd in 1970 for relational databases. In mathematics, a relation algebra is a residuated Boolean algebra supporting an involutary unary operation called converse. The… … Wikipedia
